Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH
Identifieur interne : 007398 ( Main/Exploration ); précédent : 007397; suivant : 007399Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH
Auteurs : Olivier Bournez ; Felipe Cucker ; Paulin Jacobé De Naurois ; Jean-Yves MarionSource :
English descriptors
- KwdEn :
Abstract
Considering the Blum, Shub, and Smale computational model for real numbers, extended by Poizat to general structures, classical complexity can be considered as the restriction to finite structures of a more general notion of computability and complexity working over arbitrary structures. In a previous paper, we showed that the machine-independent characterization of Bellantoni and Cook of sequential polynomial time for classical complexity is actually the restriction to finite structures of a characterization of sequential polynomial time over arbitrary structures. In this paper, we prove that the same phenomenon happens for several other complexity classes : over arbitrary structures, parallel polynomial time corresponds to safe recursion with substitutions, and the polynomial hierarchy corresponds to safe recursion with predicative minimization. Our results yield machine-independent characterizations of several complexity classes subsuming previous ones when restricted to finite structures.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003A44
- to stream Crin, to step Curation: 003A44
- to stream Crin, to step Checkpoint: 000962
- to stream Main, to step Merge: 007798
- to stream Main, to step Curation: 007398
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" wicri:score="-18">Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH</title></titleStmt><publicationStmt><idno type="RBID">CRIN:bournez03b</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003A44</idno><idno type="wicri:Area/Crin/Curation">003A44</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003A44</idno><idno type="wicri:Area/Crin/Checkpoint">000962</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000962</idno><idno type="wicri:Area/Main/Merge">007798</idno><idno type="wicri:Area/Main/Curation">007398</idno><idno type="wicri:Area/Main/Exploration">007398</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr">Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH</title><author><name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name></author><author><name sortKey="Cucker, Felipe" sort="Cucker, Felipe" uniqKey="Cucker F" first="Felipe" last="Cucker">Felipe Cucker</name></author><author><name sortKey="Jacobe De Naurois, Paulin" sort="Jacobe De Naurois, Paulin" uniqKey="Jacobe De Naurois P" first="Paulin" last="Jacobé De Naurois">Paulin Jacobé De Naurois</name></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>blum shub smale model</term><term>complexity</term><term>safe recursion</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2507">Considering the Blum, Shub, and Smale computational model for real numbers, extended by Poizat to general structures, classical complexity can be considered as the restriction to finite structures of a more general notion of computability and complexity working over arbitrary structures. In a previous paper, we showed that the machine-independent characterization of Bellantoni and Cook of sequential polynomial time for classical complexity is actually the restriction to finite structures of a characterization of sequential polynomial time over arbitrary structures. In this paper, we prove that the same phenomenon happens for several other complexity classes : over arbitrary structures, parallel polynomial time corresponds to safe recursion with substitutions, and the polynomial hierarchy corresponds to safe recursion with predicative minimization. Our results yield machine-independent characterizations of several complexity classes subsuming previous ones when restricted to finite structures.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name><name sortKey="Cucker, Felipe" sort="Cucker, Felipe" uniqKey="Cucker F" first="Felipe" last="Cucker">Felipe Cucker</name><name sortKey="Jacobe De Naurois, Paulin" sort="Jacobe De Naurois, Paulin" uniqKey="Jacobe De Naurois P" first="Paulin" last="Jacobé De Naurois">Paulin Jacobé De Naurois</name><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007398 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 007398 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:bournez03b
|texte= Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH
}}
| This area was generated with Dilib version V0.6.33. |  |